MIIC online: a web server to reconstruct causal or non-causal networks from non-perturbative data
نویسندگان
چکیده
منابع مشابه
MIIC online: a web server to reconstruct causal or non-causal networks from non-perturbative data.
Summary We present a web server running the MIIC algorithm, a network learning method combining constraint-based and information-theoretic frameworks to reconstruct causal, non-causal or mixed networks from non-perturbative data, without the need for an a priori choice on the class of reconstructed network. Starting from a fully connected network, the algorithm first removes dispensable edges b...
متن کاملA sampled-data approach to optimal non-causal downsampling
Downsampling is the process of reducing the sampling rate of a discrete signal. This paper describes how sampled data system theory can be used to design an L2 or L∞ optimal downsampler which reduces the sampling rate by a positive integer factor from a given fast sampler. This paper also describes the effect of noise on the optimal downsampling.
متن کاملNon-Causal Computation
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is...
متن کاملLearning Causal Networks from Data: A Survey and a New Algorithm for Recovering Possibilistic Causal Networks
Causal concepts play a crucial role in many reasoning tasks. Organised as a model revealing the causal structure of a domain, they can guide inference through relevant knowledge. This is an especially difficult kind of knowledge to acquire, so some methods for automating the induction of causal models from data have been put forth. Here we review those that have a graph representation. Most wor...
متن کاملA Unified View of Causal and Non-causal Feature Selection
In this paper, we unify causal and non-causal feature selection methods based on the Bayesian network framework. We first show that the objectives of causal and non-causal feature selection methods are equal and are to find the Markov blanket of a class attribute, the theoretically optimal feature set for classification. We demonstrate that causal and non-causal feature selection take different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2017
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btx844